@inproceedings{Bagan2007a,
address = "Lausanne, Switzerland",
author = "Bagan, Guillaume and Durand, Arnaud and Grandjean, Etienne",
booktitle = "CSL 2007: the 21st International Workshop on Computer Science Logic",
doi = "10.1007/978-3-540-74915-8_18",
editor = "Duparc, Jacques and Henzinger, Thomas A.",
isbn = "978-3-540-23024-3",
issn = "0302-9743",
link = "http://link.springer.com/chapter/10.1007/978-3-540-74915-8_18",
month = "sep",
pages = "208--222",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "On Acyclic Conjunctive Queries and Constant Delay Enumeration",
uri = "http://link.springer.com/chapter/10.1007/978-3-540-74915-8_18",
volume = "4646",
year = "2007",
}
@inproceedings{Boros2004a,
address = "Prague, Czech Republic",
author = "Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir",
booktitle = "MFCS 2004: the 29th International Symposium on Mathematical Foundations of Computer Science",
doi = "10.1007/978-3-540-28629-5_21",
editor = "Fiala, Jiř\'{\i} and Koubek, V\'{a}clav and Kratochv\'{\i}l, Jan",
link = "http://link.springer.com/chapter/10.1007/978-3-540-28629-5_21",
month = "aug",
number = "Di",
pages = "298--309",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Generating paths and cuts in multi-pole (di) graphs",
uri = "http://link.springer.com/chapter/10.1007/978-3-540-28629-5_21",
volume = "3153",
year = "2004",
}
@article{Bussieck1998,
author = "Bussieck, Michael R and L\"{u}bbecke, Marco E",
doi = "10.1016/S0925-7721(98)00021-2",
issn = "09257721",
journal = "Computational Geometry",
link = "http://www.sciencedirect.com/science/article/pii/S0925772198000212",
number = "2",
pages = "103--109",
title = "The vertex set of a 1/2-polytope is strongly P-enumerable",
uri = "http://www.sciencedirect.com/science/article/pii/S0925772198000212",
volume = "11",
year = "1998",
}
@article{Cheng2011,
author = "Cheng, James and Ke, Yiping and Fu, Ada Wai-Chee and Yu, Jeffrey Xu and Zhu, Linhong",
doi = "10.1145/2043652.2043654",
isbn = "9781450300322",
issn = "03625915",
journal = "ACM Transactions on Database Systems",
keyword = "H*-graph,Maximal clique enumeration,dynamic graphs,h-index,massive networks,scale-free networks",
link = "http://dl.acm.org/citation.cfm?doid=2043652.2043654",
month = "dec",
number = "4",
pages = "1--34",
publisher = "ACM",
title = "Finding maximal cliques in massive networks",
uri = "http://dl.acm.org/citation.cfm?doid=2043652.2043654",
volume = "36",
year = "2011",
}
@article{Courcelle2009c,
author = "Courcelle, Bruno",
doi = "10.1016/j.dam.2008.08.021",
issn = "0166218X",
journal = "Discrete Applied Mathematics",
keyword = "DAG,Enumeration,Monadic second-order logic,Monadic second-order transduction,Query,Random generation,Recognizable set of terms,Tree automaton,Tree-width,Unfolding,dag,enumeration,monadic second-order logic,monadic second-order transduction,project of the,query,random generation,recognizable set of terms,support,supported by the graal,this work has been,tomaton,tree au-,tree-width,unfolding",
link = "http://www.sciencedirect.com/science/article/pii/S0166218X08003363 http://linkinghub.elsevier.com/retrieve/pii/S0166218X08003363",
month = "jun",
number = "12",
pages = "2675--2700",
title = "Linear delay enumeration and monadic second-order logic",
uri = "http://www.sciencedirect.com/science/article/pii/S0166218X08003363",
volume = "157",
year = "2009",
}
@article{Durand2007,
arxivid = "cs/0507020",
author = "Durand, Arnaud and Grandjean, Etienne",
doi = "10.1145/1276920.1276923",
eprint = "0507020",
issn = "15293785",
journal = "ACM Transactions on Computational Logic",
keyword = "Computational complexity,enumeration problems,first-order logic",
link = "http://dl.acm.org/citation.cfm?id=1276920.1276923 http://arxiv.org/abs/cs/0507020",
month = "aug",
number = "4",
pages = "18",
publisher = "ACM",
title = "First-order queries on structures of bounded degree are computable with constant delay",
uri = "http://dl.acm.org/citation.cfm?id=1276920.1276923",
volume = "8",
year = "2005",
}
@inproceedings{Durand2011,
address = "Dagstuhl, Germany",
author = "Durand, Arnaud and Strozecki, Yann",
booktitle = "CSL 2011: the 25th International Workshop/20th Annual Conference of the EACSL - Computer Science Logic",
doi = "10.4230/LIPIcs.CSL.2011.189",
editor = "Bezem, Marc",
isbn = "978-3-939897-32-3",
issn = "1868-8969",
keyword = "004,descriptive complexity,enumeration,query problem",
language = "eng",
link = "http://drops.dagstuhl.de/opus/volltexte/2011/3231/",
month = "aug",
pages = "189--202",
publisher = "Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik",
series = "Leibniz International Proceedings in Informatics (LIPIcs)",
title = "Enumeration Complexity of Logical Query Problems with Second-order Variables",
uri = "http://drops.dagstuhl.de/opus/volltexte/2011/3231/",
volume = "12",
year = "2011",
}
@article{Fukuda1997,
author = "Fukuda, Komei and Liebling, Thomas M. and Margot, Fran\c{c}ois",
doi = "10.1016/0925-7721(95)00049-6",
issn = "09257721",
journal = "Computational Geometry",
link = "http://www.sciencedirect.com/science/article/pii/0925772195000496 http://linkinghub.elsevier.com/retrieve/pii/0925772195000496",
month = "jun",
number = "1",
pages = "1--12",
title = "Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron",
uri = "http://www.sciencedirect.com/science/article/pii/0925772195000496",
volume = "8",
year = "1997",
}
@inproceedings{Kazana2013b,
address = "New York, New York, USA",
author = "Kazana, Wojciech and Segoufin, Luc",
booktitle = "PODS 2013: the 32nd symposium on Principles of database systems",
doi = "10.1145/2463664.2463667",
editor = "Hull, Richard",
isbn = "9781450320665",
keyword = "bounded expansion,enumeration,first-order",
link = "http://dl.acm.org/citation.cfm?id=2463664.2463667 http://dl.acm.org/citation.cfm?doid=2463664.2463667",
month = "jun",
pages = "297",
publisher = "ACM Press",
title = "Enumeration of first-order queries on classes of structures with bounded expansion",
uri = "http://dl.acm.org/citation.cfm?id=2463664.2463667",
year = "2013",
}
@article{Kazana2013d,
author = "Kazana, Wojciech and Segoufin, Luc",
doi = "10.1145/2528928",
isbn = "9781450320665",
issn = "15293785",
journal = "ACM Transactions on Computational Logic",
keyword = "bounded expansion,enumeration,first-order",
link = "http://doi.acm.org/10.1145/2528928",
number = "4",
pages = "25:1--25:12",
title = "Enumeration of monadic second-order queries on trees",
uri = "http://doi.acm.org/10.1145/2528928",
volume = "14",
year = "2013",
}
@inproceedings{Kiyomi2012,
address = "Bordeaux, France",
author = "Kiyomi, Masashi and Okamoto, Yoshio and Saitoh, Toshiki",
booktitle = "SEA 2012: the 11th International Symposium on Experimental Algorithms",
doi = "10.1007/978-3-642-30850-5_22",
editor = "Klasing, Ralf",
link = "http://link.springer.com/chapter/10.1007/978-3-642-30850-5_22",
month = "jun",
pages = "248--259",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-30850-5_22",
volume = "7276",
year = "2012",
}
@article{McKay1998,
author = "McKay, Brendan D.",
doi = "10.1006/jagm.1997.0898",
issn = "01966774",
journal = "Journal of Algorithms",
link = "http://www.sciencedirect.com/science/article/pii/S0196677497908981 http://linkinghub.elsevier.com/retrieve/pii/S0196677497908981",
month = "feb",
number = "2",
pages = "306--324",
title = "Isomorph-Free Exhaustive Generation",
uri = "http://www.sciencedirect.com/science/article/pii/S0196677497908981",
volume = "26",
year = "1998",
}
@article{Nutov2009,
author = "Nutov, Zeev",
doi = "10.1016/j.dam.2008.04.026",
issn = "0166218X",
journal = "Discrete Applied Mathematics",
keyword = "Intersecting families,Listing,Minimal edge-covers,Steiner network",
link = "http://www.sciencedirect.com/science/article/pii/S0166218X08002060 http://linkinghub.elsevier.com/retrieve/pii/S0166218X08002060",
month = "jan",
number = "1",
pages = "112--117",
title = "Listing minimal edge-covers of intersecting families with applications to connectivity problems",
uri = "http://www.sciencedirect.com/science/article/pii/S0166218X08002060",
volume = "157",
year = "2009",
}
@article{Proskurowski1998,
author = "Proskurowski, Andrzej and Ruskey, Frank and Smith, Malcolm",
doi = "10.1137/S0895480192234009",
issn = "0895-4801",
journal = "SIAM Journal on Discrete Mathematics",
keyword = "05A15,05C30,60J10,68Q25,68R05,68R15,Stirling numbers,combinatorial generation,k-ary strings,k-paths,restricted growth function",
language = "en",
link = "http://epubs.siam.org/doi/abs/10.1137/S0895480192234009",
month = "feb",
number = "1",
pages = "94--109",
publisher = "Society for Industrial and Applied Mathematics",
title = "Analysis of Algorithms for Listing Equivalence Classes of k -ary Strings",
uri = "http://epubs.siam.org/doi/abs/10.1137/S0895480192234009",
volume = "11",
year = "1998",
}
@inproceedings{Ramon2007,
address = "Florence, Italy",
author = "Ramon, Jan and Nijssen, Siegfried",
booktitle = "Mining and Learning with Graphs - MLG 2007",
link = "http://eprints.pascal-network.org/archive/00003617/",
month = "aug",
pages = "4",
title = "General Graph Refinement with Polynomial Delay",
uri = "http://eprints.pascal-network.org/archive/00003617/",
year = "2007",
zzzdoi = "MY/Ramon_Nijssen_00003617",
zzzeditor = "-, -",
}
@article{Ramon2009,
author = "Ramon, Jan and Nijssen, Siegfried",
issn = "1532-4435",
journal = "The Journal of Machine Learning Research",
link = "http://dl.acm.org/citation.cfm?id=1577069.1577102",
month = "dec",
number = "-",
pages = "907--929",
publisher = "JMLR.org",
title = "Polynomial-Delay Enumeration of Monotonic Graph Classes",
uri = "http://dl.acm.org/citation.cfm?id=1577069.1577102",
volume = "10",
year = "2009",
zzzdoi = "MY/1577069.1577102",
}
@article{Seidel1990,
author = "Seidel, Raimund",
doi = "10.1007/BF02574699",
isbn = "0897913620",
issn = "01795376",
journal = "Discrete \& Computational Geometry",
link = "http://dl.acm.org/citation.cfm?id=98570",
number = "1",
pages = "423--434",
title = "Small-dimensional linear programming and convex hulls made easy",
uri = "http://dl.acm.org/citation.cfm?id=98570",
volume = "6",
year = "1991",
}
@inproceedings{Strozecki2010a,
address = "Brno, Czech Republic",
author = "Strozecki, Yann",
booktitle = "MFCS 2010: the 35th International Symposium on Mathematical Foundations of Computer Science",
doi = "10.1007/978-3-642-15155-2_55",
editor = "Hlin\v{e}n\'{y}, Petr and Ku\v{c}era, Anton\'{\i}n",
link = "http://link.springer.com/chapter/10.1007/978-3-642-15155-2_55",
month = "aug",
pages = "629--640",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Enumeration of the Monomials of a Polynomial and Related Complexity Classes",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-15155-2_55",
volume = "6281",
year = "2010",
}
@article{Watanabe1981,
author = "Watanabe, Osamu",
doi = "10.1016/0020-0190(81)90139-3",
issn = "00200190",
journal = "Information Processing Letters",
link = "http://www.sciencedirect.com/science/article/pii/0020019081901393",
number = "1",
pages = "1--3",
title = "A fast algortihm for finding all shortest paths",
uri = "http://www.sciencedirect.com/science/article/pii/0020019081901393",
volume = "13",
year = "1981",
}
@article{Yamanaka2007,
author = "Yamanaka, Katsuhisa and Kawano, Shin-ichiro and Kikuchi, Yosuke and Nakano, Shin-ichi",
doi = "10.1093/ietfec/e90-a.5.888",
issn = "09168508",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
keyword = "Algorithm,Generation,Integer partition,The family tree",
link = "http://search.ieice.org/bin/summary.php?id=e90-a_5_888\&category=A\&year=2007\&lang=E\&abst=",
number = "5",
pages = "888--895",
title = "Constant time generation of integer partitions",
uri = "http://search.ieice.org/bin/summary.php?id=e90-a_5_888&category=A&year=2007&lang=E&abst=",
volume = "E90-A",
year = "2007",
}
@inproceedings{Zhuang2010b,
address = "Rome, Italy",
author = "Zhuang, Bingbing and Nagamochi, Hiroshi",
booktitle = "CIAC 2010: the 7th International Conference on Algorithms and Complexity",
doi = "10.1007/978-3-642-13073-1_6",
editor = "Calamoneri, Tiziana and Diaz, Josep",
link = "http://link.springer.com/chapter/10.1007/978-3-642-13073-1_6",
month = "may",
pages = "49--60",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Enumerating rooted graphs with reflectional block structures",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-13073-1_6",
volume = "6078",
year = "2010",
}